Constraint Logic Programming and Integer Programming approaches and their collaboration in solving an assignment scheduling problem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Integer Programming, Constraint Logic Programming and Their Collaboration in Solving Discrete Optimisation Problems

The work reported in this thesis investigates the suitability and effectiveness of combining two different solving technologies and applying them to a set of discrete optimisation problems. The technologies considered are Integer Programming (IP) and Constraint Logic Programming using Finite Domains (CLP(FD)). Both approaches generally address the same set of problems and consist of complete al...

متن کامل

preventive maintenance scheduling with integer programming and constraint programming

preventive maintenance scheduling is to perform a series of tasks that prevents or minimizes production breakdowns and improves the reliability. mathematical models have been developed to solve the preventive maintenance scheduling problem. there are several limitations in the prior work in this area of research. craft combinations are assumed to be given. the craft combination problem concerns...

متن کامل

Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates

W consider both branch-and-cut and column-generation approaches for the problem of finding a minimumcost assignment of jobs with release dates and deadlines to unrelated parallel machines. Results are presented for several variants both with and without constraint programming. Among the variants, the most effective strategy is to combine a tight and compact, but approximate, mixed integer progr...

متن کامل

Solving Resource Allocation/Scheduling Problems with Constraint Integer Programming

Constraint Integer Programming (CIP) is a generalization of mixed-integer programming (MIP) in the direction of constraint programming (CP) allowing the inference techniques that have traditionally been the core of CP to be integrated with the problem solving techniques that form the core of complete MIP solvers. In this paper, we investigate the application of CIP to scheduling problems that r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Constraints

سال: 1997

ISSN: 1383-7133,1572-9354

DOI: 10.1007/bf00137871